SBH: Super byte-aligned hybrid bitmap compression

Bitmap indexes are commonly used in data warehousing applications such as on-line analytic processing (OLAP). Storing the bitmaps in compressed form has been shown to be effective not only for low cardinality attributes, as conventional wisdom would suggest, but also for high cardinality attributes. Compressed bitmap indexes, such as Byte-aligned Bitmap Compression (BBC), Word-Aligned Hybrid (WAH) and several of their variants have been shown to be efficient in terms of both time and space, compared to traditional database indexes. In this paper, we propose a new technique for compressed bitmap indexing, called Super Byte-aligned Hybrid (SBH) bitmap compression, which improves upon the current state-of-the-art compression schemes. In our empirical evaluation, the query processing time of SBH was about five times faster than that of WAH, while the size of its compressed bitmap indexes was retained nearly close to that of BBC.     

基于Pro/E弧面凸轮分度装置的3D参数化设计

以弧面凸轮分度装置的中心距和分度滚子数为已知条件,定义了与其他所有尺寸的参数关系,并且基于Pro/Engineer Wildfire 4.0以及其二次开发工具Program对弧面凸轮分度装置做了如下研究工作:以弧面凸轮分度装置为研究对象,系统阐述了其工作原理、设计方法、运动形式以及结构形式;以Pro/E作为三维建模工具...     

滚珠型弧面凸轮分度机构的运动分析和仿真

滚珠型弧面凸轮分度机构中滚珠的运动影响到机构的润滑、失效形式和传动效率。滚珠中心、滚珠与凸轮滚道接触点及滚珠与分度盘球窝接触点相对于凸轮旋转轴线运动轨迹为螺旋曲线,计算表明3条曲线的螺旋升角大小不同。利用螺旋传动理论,分析滚珠的运动形式,计算滚珠的侧滑速度。应用RecurDyn软件对机构进行运动学仿真,验证了滚珠侧滑和锲紧的存在及负载转动惯量对分度盘运动规律的影响。     

一种大容量文本集的智能检索方法

分析了潜在语义模型,研究了潜在语义空间中文本的表示方法,提出了一种大容量文本集的检索策略。检索过程由粗粒度非相关剔除和相关文本的精确检索两个步骤组成。使用潜在语义空间模型对文本集进行初步的筛选,剔除非相关文本;使用大规模文本检索方法对相关文本在段落一级进行精确检索,其中为了提高检索的执行效率,在检索算法中引入了遗传算法;输出这些候选的段落序号。实验结果证明了这种方法的有效性和高效性。     

基于支持向量机的隐含语意特征选择方法

隐含语意索引(LSI)是一个能有效捕获文档中词的隐含语意特征的方法。然而,用该方法选择的特征空间对文本分类来说可能不是最适合的,因为这种方法按照词的变化排序特征,而没有考虑到分类能力。支持向量机(SVM)高度的泛化能力使它特别适用于高维数据例如文档的分类。为此提出基于支持向量机的特征提取方法用于选择适于分类的LSI特征。该方法利用SVM高度泛化的分类能力, 通过使用在每一个规则下训练的分类器的参数对第k个特征对反向平方分解面的贡献w2k的值进行估计。实验表明当需要比LSI更少的训练和测试时间时,该方法能够以更为紧凑的表示方式提高分类性能。     

Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures

Shape matching and indexing is important topic in its own right, and is a fundamental subroutine in most shape data mining algorithms. Given the ubiquity of shape, shape matching is an important problem with applications in domains as diverse as biometrics, industry, medicine, zoology and anthropology. The distance/similarity measure for used for shape matching must be invariant to many distortions, including scale, offset, noise, articulation, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure used. However, rotation invariance is noted in the literature as being an especially difficult challenge. Current approaches typically try to achieve rotation invariance in the representation of the data, at the expense of discrimination ability, or in the distance measure, at the expense of efficiency. In this work, we show that we can take the slow but accurate approaches and dramatically speed them up. On real world problems our technique can take current approaches and make them four orders of magnitude faster without false dismissals. Moreover, our technique can be used with any of the dozens of existing shape representations and with all the most popular distance measures including Euclidean distance, dynamic time warping and Longest Common Subsequence. We further show that our indexing technique can be used to index star light curves, an important type of astronomical data, without modification. Reproducible Research Statement: All datasets and images used in this work are freely available at .     

城市变电所与电缆接口设计常见问题与对策

城网建设与改造的特点之一是变电所的小型化和采用电缆出线。本文对近几年城网建设和改造中遇到的变电和送电专业配合、变电所和电缆出线建设不同期、变电所周边现状和未来规划不一致、地下物和规划勘察资料不符、市政道路建设时已预埋进所过路管线、相序核查不准而造成的六种设计接口问题进行了分析,并逐一提出了解决办法。     

互补网络中多级混合过滤系统的研究

针对适合互补结构网络信息特点的过滤机制进行研究,提出一种改进的用户兴趣模型,在研究内容过滤和协作过滤的基础上．建立适合互补结构网络的多级混合过滤系统。通过对多级混合过滤模型的实验,表明多级混合过滤模型克服了单独使用内容过滤或协作过滤方法的缺点,提高了过滤的准确度。     

Fast detection of exact clones in business process model repositories

As organizations reach higher levels of business process management maturity, they often find themselves maintaining very large process model repositories, representing valuable knowledge about their operations. A common practice within these repositories is to create new process models, or extend existing ones, by copying and merging fragments from other models. We contend that if these duplicate fragments, a.k.a. exact clones, can be identified and factored out as shared subprocesses, the repository's maintainability can be greatly improved. With this purpose in mind, we propose an indexing structure to support fast detection of clones in process model repositories. Moreover, we show how this index can be used to efficiently query a process model repository for fragments. This index, called RPSDAG, is based on a novel combination of a method for process model decomposition (namely the Refined Process Structure Tree), with established graph canonization and string matching techniques. We evaluated the RPSDAG with large process model repositories from industrial practice. The experiments show that a significant number of non-trivial clones can be efficiently found in such repositories, and that fragment queries can be handled efficiently.     

iSAX: disk-aware mining and indexing of massive time series datasets

Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, the algorithms and the size of data considered have generally not been representative of the increasingly massive datasets encountered in science, engineering, and business domains. In this work, we introduce a novel multi-resolution symbolic representation which can be used to index datasets which are several orders of magnitude larger than anything else considered in the literature. To demonstrate the utility of this representation, we constructed a simple tree-based index structure which facilitates fast exact search and orders of magnitude faster, approximate search. For example, with a database of one-hundred million time series, the approximate search can retrieve high quality nearest neighbors in slightly over a second, whereas a sequential scan would take tens of minutes. Our experimental evaluation demonstrates that our representation allows index performance to scale well with increasing dataset sizes. Additionally, we provide analysis concerning parameter sensitivity, approximate search effectiveness, and lower bound comparisons between time series representations in a bit constrained environment. We further show how to exploit the combination of both exact and approximate search as sub-routines in data mining algorithms, allowing for the exact mining of truly massive real world datasets, containing tens of millions of time series.